#include<iostream>
#include<string>
#include<queue>
using namespace std;
typedef struct node *BTree;
typedef struct node{
	char data;
	BTree lchild;
	BTree rchild;
}TNode;
BTree CreateBTree(string str,int i)
{
   int len;
   BTree bt;
   bt=new TNode;
   len=str.size();
   if(i>len-1 || i<=0) return NULL;
   if(str[i]=='#') return NULL;
   bt->data =str[i];
   bt->lchild =CreateBTree(str,2*i); 
   bt->rchild =CreateBTree(str,2*i+1); 	
   return bt;
}
#include<iostream>
#include<string.h>
using namespace std;
int main()
{
	char str[80],a[80];
	gets(str);
	int i,j,flag=0;
	int len=strlen(str);
	if(len==0&&str[0]=='\0')
	{
		cout<<"NULL"<<endl;
		return 0;
	}
	j=0;
	for(i=0;i<len;i++)
	{
		if(str[i]!='#')
			a[j++]=str[i];
		else
			flag++;
	}
	for(i=0;i<j;i++)
	{
		if(i<j-1)
			cout<<a[i]<<" ";
		else if(i==j-1)
			cout<<a[i]<<endl;
	}
	if(flag==len)
	{
		cout<<"NULL"<<endl;
		return 0;
	}
	return 0;
}
